منابع مشابه
Moments of Matching Statistics
We show that for a large family of combinatorial statistics on perfect matchings, the moments can be expressed as a linear combination of double factorials with constant coefficients. This gives a stronger analogous result of Chern, Diaconis, Kane and Rhoades on statistics of set partitions, in which case the moments can be expressed as linear combinations of shifted Bell numbers, but with poly...
متن کاملOn the statistics of matching pursuit angles
Matching Pursuit decompositions have been employed for signal coding. For this purpose, Matching Pursuit coefficients need to be quantized. However, their behavior has been shown to be chaotic in some cases; posing difficulties to their modeling and quantizer design. In this work, a different approach is presented. Instead of trying to model the statistics of Matching Pursuit coefficients, the ...
متن کاملPattern Matching Statistics on Correlated Sources
In pattern matching algorithms, two characteristic parameters play an important rôle : the number of occurrences of a given pattern, and the number of positions where a pattern occurrence ends. Since there may exist many occurrences which end at the same position, these two parameters may differ in a significant way. Here, we consider a general framework where the text is produced by a probabil...
متن کاملInvestigating MS2/MS3 matching statistics: a model for coupling consecutive stage mass spectrometry data for increased peptide identification confidence.
Improvements in ion trap instrumentation have made n-dimensional mass spectrometry more practical. The overall goal of the study was to describe a model for making use of MS(2) and MS(3) information in mass spectrometry experiments. We present a statistical model for adjusting peptide identification probabilities based on the combined information obtained by coupling peptide assignments of cons...
متن کاملInvestigating Parallel Interpretation-Tree Model Matching Algorithms with ProSet-Linda
This paper discusses the development of algorithms for parallel interpretation-tree model matching for 3-D computer vision applications such as object recognition. The algorithms are developed with a prototyping approach using ProSet-Linda. ProSet is a procedural prototyping language based on the theory of nite sets. The coordination language Linda provides a distributed shared memory model, ca...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Molecular & Cellular Proteomics
سال: 2008
ISSN: 1535-9476
DOI: 10.1074/mcp.m700128-mcp200